Domination numbers and zeros of chromatic polynomials
نویسندگان
چکیده
In this paper, we shall prove that if the domination number of G is at most 2, then P (G,λ) is zero-free in the interval (1, β), where β = 2 + 1 6 3 √ 12 √ 93− 108− 1 6 3 √ 12 √ 93 + 108 = 1.317672196 · · · , and P (G, β) = 0 for some graph G with domination number 2. We also show that if ∆(G) ≥ v(G) − 2, then P (G,λ) is zero-free in the interval (1, β′), where β′ = 5 3 + 1 6 3 √ 12 √ 69− 44− 1 6 3 √ 12 √ 69 + 44 = 1.430159709 · · · , and P (G, β′) = 0 for some graph G with ∆(G) = v(G)− 2. ∗Supported by AcRf project RI 5/06 DFM of National Institute of Education, Singapore. †Corresponding author. Email:[email protected].
منابع مشابه
Chromatic polynomials of random graphs
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009New J. Phys. 11 023001) nowmake it possible to compute chromatic polynomia...
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملChromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملOn the Zeros of Plane Partition Polynomials
Over the past ten years, many examples of natural polynomial families from combinatorics and number theory have emerged whose zeros for high degrees appear to converge to intriguing curves in the complex plane. One interesting collection of examples appears on the website [16] of Richard Stanley which includes chromatic polynomials of complete partite graphs, q-analogue of Catalan numbers, Bern...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008